Investigation of Strength and Security of Pseudo Random Number Generators

Abstract Security is a key factor in today’s fast communicating world. Many cryptographic algorithms are tested and put into use efficiently. Random numbers used diverse forms like nonces, secret key, initialization vector, etc. They find place encryption, digital signature, hashing algorithms. A deterministic takes an intial seed value as input produces pseudo random with falsely induced randomness. This research work extensively surveys large set of state-of-the-art PRNGs categorizes them based on methodology to produce them. We compared their statistical results obtained from various test tools NIST SP 800-22, TestU01. Finally, security analyses were done quantitatively for space, sensitivity, entropy, speed bit generation, linear complexity. At last, we concluded the some future directions researchers carry out improving PRNGs.